A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks
نویسندگان
چکیده
منابع مشابه
A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملA Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
Given n elements with nonnegative integer weights w1, . . . , wn and an integer capacity C, we consider the counting version of the classic knapsack problem: find the number of distinct subsets whose weights add up to at most the given capacity. We give a deterministic algorithm that estimates the number of solutions to within relative error 1±ε in time polynomial in n and 1/ε (fully polynomial...
متن کاملA Deterministic Algorithm for Pliable Index Coding
Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any) one message she does not already have. Previous work has shown that the server can achieve this using O(log(n)) transmissions and needs at least Ω(log(n)) tra...
متن کاملDeterministic Differential Search Algorithm for Distributed Sensor/Relay Networks
For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply since the power source of the transmitters cannot be recharged continually. To resolve this, distributed beamforming has been proposed as a viable solution wh...
متن کاملA deterministic pseudorandom perturbation scheme for arbitrary polynomial predicates
We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny’s simple randomized linear perturbation scheme with Yap’s multiple infinitesimal scheme for general predicates. Like the randomized scheme, our method accepts black box polynomial functions as input. For nonmaliciously chosen predicates, our method is as fast a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2273793